Thep-Length of a Solvable Group Bounded by Conditions on its Character Degree Graph
نویسندگان
چکیده
منابع مشابه
A characterization of L3(4) by its character degree graph and order
Let G be a finite group. The character degree graph [Formula: see text] of G is the graph whose vertices are the prime divisors of character degrees of G and two vertices p and q are joined by an edge if pq divides the character degree of G. Let [Formula: see text] be the projective special linear group of degree n over a finite field of order q. Khosravi et. al. have shown that the simple grou...
متن کاملBounding the Number of Character Degrees of a Solvable Group
A difficult problem in the character theory of solvable groups is to show that the number c.d. (G) of irreducible character degrees of a solvable group G is equal to or greater than d.l. (G), the derived length of G. Isaacs [4] has shown that d.l. (G) ^ 3 c.d. (G)-2 for every solvable group. Berger [1] subsequently proved that d.l. (G) < c.d. (G) when | G | is odd. This problem belongs to the c...
متن کاملA note on the order graph of a group
The order graph of a group $G$, denoted by $Gamma^*(G)$, is a graph whose vertices are subgroups of $G$ and two distinct vertices $H$ and $K$ are adjacent if and only if $|H|big{|}|K|$ or $|K|big{|}|H|$. In this paper, we study the connectivity and diameter of this graph. Also we give a relation between the order graph and prime graph of a group.
متن کاملThe Complexity of Bounded Length Graph Recoloring
We study the following question: Given are two k-colorings α and β of a graph G on n vertices, and integer l. The question is whether α can be modified into β, by recoloring vertices one at a time, while maintaining a k-coloring throughout, and using at most l such recoloring steps. This problem is weakly PSPACE-hard for every constant k ≥ 4. We show that it is also strongly NP-hard for every c...
متن کاملBounded Approximate Character Amenability of Banach Algebras
The bounded approximate version of $varphi$-amenability and character amenability are introduced and studied. These new notions are characterized in several different ways, and some hereditary properties of them are established. The general theory for these concepts is also developed. Moreover, some examples are given to show that these notions are different from the others. Finally, bounded ap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1996
ISSN: 0021-8693
DOI: 10.1006/jabr.1996.0368